Step of Proof: int_seg_wf
9,38
postcript
pdf
Inference at
*
I
of proof for Lemma
int
seg
wf
:
m
,
n
:
. {
m
..
n
}
Type
latex
by ((Unfold `int_seg` 0)
CollapseTHEN ((Auto_aux (first_nat 1:n) ((first_nat 1:n),(first_nat 3:n
C
)) (first_tok :t) inil_term)))
latex
C
.
Definitions
P
Q
,
i
j
<
k
,
{
i
..
j
}
,
t
T
,
x
:
A
.
B
(
x
)
,
Lemmas
le
wf
origin